Fast upper and lower bounds for a large‐scale real‐world arc routing problem

Arc routing problems (ARPs) are a special kind of vehicle problem, in which the demands located on edges or arcs, instead nodes. There is huge literature ARPs, and variety exact heuristic algorithms available. Recently, however, we encountered some real-life ARPs with over 10 000 roads, much larger than those usually considered literature. For these problems, develop fast upper- lower-bounding procedures. We also present extensive computational results.